Affirmative Solutions on Local Antimagic Chromatic Number
نویسندگان
چکیده
منابع مشابه
Local chromatic number of quadrangulations of surfaces
The local chromatic number of a graph G, as introduced in [4], is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors. In [17] a connection of the local chromatic number to topological properties of (a box complex of) the graph was established and in [18] it was shown that a topological ...
متن کاملOn Perles’ question and local chromatic number of graphs
Our principal aim is to give the complete answer to the question posed by Micha Perles, which generalizes the Lyusternik-Schnirel’man version of the Borsuk-Ulam theorem. As a consequence, we also obtain the improved lower bound for the local chromatic number of certain class of graphs.
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملLocal chromatic number and topological properties of graphs ( Extended abstract )
The local chromatic number of a graph, introduced by Erdős et al. in (4), is the minimum number of colors that must appear in the closed neighborhood of some vertex in any proper coloring of the graph. This talk, based on the papers (14; 15; 16), would like to survey some of our recent results on this parameter. We give a lower bound for the local chromatic number in terms of the lower bound of...
متن کاملLocal Chromatic Number and Distinguishing the Strength of Topological Obstructions
The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific topological obstructions that have the same implications for the chromatic number have different implications for the local chromatic number. These two obstructions can be formulated in terms of the hom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2020
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-020-02197-2